Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
271	Complexity-Based Imprecision and Improvisation as Methodology Robert Woog University of Western Sydney Locked Bag 1797 Add to Reading List Source URL: www.metaphorum.org Language: English - Date: 2007-03-05 07:17:30 Metaphysics Philosophy Systems science Complex systems theory Fractals Systems Chaos theory Cybernetics Fractal Attractor Self-organization Complex system
272	Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2011-05-18 09:50:44 Graph theory Mathematics Combinatorial optimization Computational complexity theory Routing algorithms Search algorithms Operations research Matching A* search algorithm Flow network
273	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
274	Efficient Computation of Two-dimensional Solution Sets Maximizing the Epsilon-Indicator Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:55 Computational complexity theory Mathematical optimization Multi-objective optimization Fourier analysis Approximation algorithms Analysis Mathematics Applied mathematics Delone set Differential of a function
275	COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:55:28 Mathematics Computational complexity theory Graph theory Polynomials Complexity classes Computational problems Mathematical optimization Tutte polynomial Chromatic polynomial Optimization problem NP Matroid
276	Fast d-DNNF Compilation with sharpSAT Christian Muise Sheila McIlraith J. Christopher Beck Add to Reading List Source URL: www.haz.ca Language: English - Date: 2013-10-28 07:18:32 Theoretical computer science Mathematics Formal methods Constraint programming Boolean algebra Automated theorem proving DPLL algorithm Binary decision diagram Exponential time hypothesis Computational complexity theory Bayesian network Distribution
277	Advances in Abstract Categorial Grammars Language Theory and Linguistic Modeling Lecture 5 Add to Reading List Source URL: research.nii.ac.jp Language: English - Date: 2010-06-08 00:59:22 Complexity classes Syntax NP Parse tree Cognitive science Grammar Philosophy of language CYK algorithm
278	Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a Add to Reading List Source URL: www.hieratic.eu Language: English Computational complexity theory Theory of computation Dynamic programming Markov decision process Stochastic control Analysis of algorithms Mathematical logic Reinforcement learning Time complexity Algorithm PP
279	Networks embedded in Lorentzian spaces James R Clough & Tim Evans Imperial College London, Centre for Complexity Science September 11, 2015 Add to Reading List Source URL: www.monmeetings.org Language: English - Date: 2015-09-16 12:54:24 Lorentzian manifolds Theoretical physics Theory of relativity Exact solutions in general relativity Causal sets Quantum gravity Spacetime Metric tensor Minkowski space Hyperbolic geometry Pseudo-Riemannian manifold
280	J. Cryptol: 116–135 DOI: s00145x Parallel Repetition of Computationally Sound Protocols Revisited∗ Krzysztof Pietrzak Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 09:00:34 Complexity classes Cryptography Computational complexity theory Proof of knowledge IP Quantum complexity theory Soundness NP Commitment scheme PSPACE PP Security parameter

UPDATE